CARIN: A Representation Language Combining Horn Rules and Description Logics
نویسندگان
چکیده
We describe CARIN, a novel family of representation languages, which integrate the expressive power of Horn rules and of description logics. We address the key issue in designing such a language, namely, providing a sound and complete inference procedure. We identify existential entailment as a core problem in reasoning in CARIN, and describe an existential entailment algorithm for CARIN languages whose description logic component is ALCNR. This algorithm entails several important results for reasoning in CARIN, most notably: (1) a sound and complete inference procedure for non recursive CARIN-ALCNR, and (2) an algorithm for determining rule subsumption overALCNR.
منابع مشابه
Combining description logics and Horn rules with uncertainty in ARTIGENCE
We present ARTIGENCE, a representation language that combines description logics and Horn rules with uncertainty. ARTIGENCE capabilities go beyond the similar hybrid systems presently available, and it contains three components: a highly expressive description logic ACLNR, a set of probabilistic Horn rules and a set of ground facts. The new features described, often required in realistic applic...
متن کاملExtending CARIN to the Description Logics of the SH Family
This work studies the extension of the existential entailment algorithm of CARIN to DLs of the SH family. The CARIN family of knowledge representation languages was one of the first hybrid languages combining DATALOG rules and Description Logics. For reasoning in one of its prominent variants, which combines ALCNR with non-recursive DATALOG, the blocking conditions of the standard tableaux proc...
متن کاملCARIN: Description Logics as a Constraint Language in Horn Rule Languages
We describe carin, a novel family of hybrid declarative programming languages, that extend the expressive power of Horn rule languages by incorporating description logics as a constraint sublanguage. Description logics are declarative object-oriented languages that have been designed especially for the purpose of representing domains with rich hierarchical structure, and have been used in sever...
متن کاملThe Limits on Combining Recursive Horn Rules withDescription
Horn rule languages have formed the basis for many Artiicial Intelligence application languages, but are not expressive enough to model domains with a rich hierarchical structure. Description logics have been designed especially to model rich hierarchies. Several applications would signiicantly beneet from combining the expressive power of both formalisms. This paper focuses on combining recurs...
متن کاملAdding Probabilities and Rules to Owl Lite Subsets Based on Probabilistic Datalog
This paper proposes two probabilistic extensions of variants of the OWL Lite description language, which are essential for advanced applications like information retrieval. The first step follows the axiomatic approach of combining description logics and Horn clauses: Subsets of OWL Lite are mapped in a sound and complete way onto Horn predicate logics (Datalog variants). Compared to earlier ap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996